منابع مشابه
Repeated-root cyclic codes
In the theory of cyclic codes, it is common practice to require that (n,q)= 1, where n is the word length and Fq is the alphabet. This ensures that the generator g ( x ) of the cyclic code has no multiple zeros ( = repeated mots). Furthermore it makes it possible to use an idempotent element as generator. However, much of the theory also goes through without the restriction on n and q. Recently...
متن کاملOn Repeated-root Cyclic Codes
A parity-check matrix for a q -ary repeated-root cyclic code is derived using the Hasse derivative. Then the min imum distance of a q-ary repeated-root cyclic code C is expressecin terms of the min imum distance of a certain simple-root cyclic code C that is determined by C. With the help of this result, several binary repeated-root cyclic codes of lengths up to n = 62 are shown to contain the ...
متن کاملA note on repeated-root cyclic codes
In papers by Castagnoli et al. and Van Lint, cyclic codeswith repeated roots are analyzed. Both papers fail to acknowledge apreviouswork by Chen, dating back to 1969, which includes an analysisof even, length binary cyclic codes. Results from Chen’s study arepresented. Index Terms -Binary cyclic codes of even length. In [l] and [2], the so called repeated-root cyclic codes h...
متن کاملSquaring Construction for Repeated-Root Cyclic Codes
We considered repeated-root cyclic codes whose block length is divisible by the characteristic of the underlying field. Cyclic self dual codes are also the repeated root cyclic codes. It is known about the one-level squaring construction for binary repeated root cyclic codes. In this correspondence, we introduced of two level squaring construction for binary repeated root cyclic codes of length...
متن کاملB-symbol Distance Distribution of Repeated-root Cyclic Codes
Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitations of the reading process in high-density data storage technologies. Yaakobi et al. [8] introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we come up with a me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1991
ISSN: 0018-9448
DOI: 10.1109/18.75250